منابع مشابه
Bandwidth of Firing Squad Algorithms
The Firing Squad Synchronization Problem (FSSP) is one of the best-studied problems for Cellular Automata (CA) and is part of many more sophisticated algorithms. Solutions for it such as the one from Mazoyer or Gerken use travelling signals, a basic technique of CA algorithms. Hence in addition to their importance, they represent typical CA algorithms. Beside the interest in their bandwidth fol...
متن کاملAn Optimal Self-stabilizing Firing Squad
Consider a fully connected network where up to t processes may crash, and all processes start in an arbitrary memory state. The self-stabilizing firing squad problem consists of eventually guaranteeing simultaneous response to an external input. This is modeled by requiring that the non-crashed processes “fire” simultaneously if some correct process received an external “go” input, and that the...
متن کاملSmaller solutions for the firing squad
In this paper we improve the bounds on the complexity of solutions to the ̄ring squad problem, also known as the ̄ring synchronization problem. In the ̄ring synchronization problem we consider a one-dimensional array of n identical ̄nite automata. Initially all automata are in the same state except for one automaton designated as the initiator for the synchronization. Our results hold for the origi...
متن کاملOn Formulations of Firing Squad Synchronization Problems
We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used is determined by the boundary condition of the general. We show that the usual formulation and the new formulation yield different minimum firing times for some variations of the problem. Our results suggest that the new formulat...
متن کاملVarious Solutions to the Firing Squad Synchronization Problems
We present different classes of solutions to the Firing Squad Synchronization Problem on networks of different shapes. The nodes are finite state processors that work at unison discrete steps. The networks considered are the line, the ring and the square. For all of these models we have considered one and two-way communication modes and also constrained the quantity of information that adjacent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurology
سال: 2018
ISSN: 0028-3878,1526-632X
DOI: 10.1212/wnl.0000000000006164